#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <cstring>
#include <algorithm>

#define FOR(i,a,n) for(int i=a,_n(n);i<_n;++i)
#define REP(i,n) FOR(i,0,n)

using namespace std;

typedef long long lld;

lld dp[12][26][12][12];//n,26,k,m

void Init(int n,int m,int k)
{
    memset(dp,0,sizeof(dp));
    REP(j,26) dp[0][j][0][1] = 1;
}

lld GetAns(int n,int m,int k)
{
    Init(n,m,k);
    REP(i,n) REP(j,26)
    {
        REP(ki,k+1)
        {
            FOR(mi,1,m+1)
            {
                REP(tp,j)
                {
                    dp[i+1][tp][ki][1] += dp[i][j][ki][mi];
                }
                FOR(tp,j,26)
                {
                    int kx = ki==k?ki:ki+1;
                    if(mi+1==m) dp[i+1][tp][kx][mi+1] += dp[i][j][ki][mi];
                    else if(mi==m) dp[i+1][tp][kx][mi] += dp[i][j][ki][mi];
                    else dp[i+1][tp][ki][mi+1] += dp[i][j][ki][mi];
                }
            }
        }
    }
    lld ans = 0;
    REP(i,26) REP(mi,m+1) ans += dp[n-1][i][k][mi];
    return ans;
}

int main()
{
    int n,m,k;
    while(cin>>n>>m>>k)
    {
        cout<<GetAns(n,m,k)<<endl;
    }
	return 0;
}
